Unified treatment of synchronization patterns in generalized networks with higher-order, multilayer, and temporal interactions

When describing complex interconnected systems, one often has to go beyond the standard network description to account for generalized interactions. Here, we establish a unified framework to simplify the stability analysis of cluster synchronization patterns for a wide range of generalized networks, including hypergraphs, multilayer networks, and temporal networks. The framework is based on finding a simultaneous block diagonalization (SBD) of the matrices encoding the synchronization pattern and the network topology. As an application, we use SBD to discover a novel type of chimera states that only appear in the presence of higher-order interactions. The unified framework established here can be extended to other dynamical processes and can facilitate the discovery of novel emergent phenomena in complex systems with generalized interactions

Relativistic Invariance of Lyapunov Exponents in Bounded and Unbounded Systems

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)The study of chaos in relativistic systems has been hampered by the observer dependence of Lyapunov exponents (LEs) and of conditions, such as orbit boundedness, invoked in the interpretation of LEs as indicators of chaos. Here we establish a general framework that overcomes both difficulties and apply the resulting approach to address three fundamental questions: how LEs transform under Lorentz and Rindler transformations and under transformations to uniformly rotating frames. The answers to the first and third questions show that inertial and uniformly rotating observers agree on a characterization of chaos based on LEs. The second question, on the other hand, is an ill-posed problem due to the event horizons inherent to uniformly accelerated observers.10218Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq

Chaos in the Gauge/Gravity Correspondence

We study the motion of a string in the background of the Schwarzschild black hole in AdS_5 by applying the standard arsenal of dynamical systems. Our description of the phase space includes: the power spectrum, the largest Lyapunov exponent, Poincare sections and basins of attractions. We find convincing evidence that the motion is chaotic. We discuss the implications of some of the quantities associated with chaotic systems for aspects of the gauge/gravity correspondence. In particular, we suggest some potential relevance for the information loss paradox.Comment: 29 pages, 11 figure

Optimizing topological cascade resilience based on the structure of terrorist networks

Complex socioeconomic networks such as information, finance and even terrorist networks need resilience to cascades - to prevent the failure of a single node from causing a far-reaching domino effect. We show that terrorist and guerrilla networks are uniquely cascade-resilient while maintaining high efficiency, but they become more vulnerable beyond a certain threshold. We also introduce an optimization method for constructing networks with high passive cascade resilience. The optimal networks are found to be based on cells, where each cell has a star topology. Counterintuitively, we find that there are conditions where networks should not be modified to stop cascades because doing so would come at a disproportionate loss of efficiency. Implementation of these findings can lead to more cascade-resilient networks in many diverse areas.Comment: 26 pages. v2: In review at Public Library of Science ON

Ising model for distribution networks

An elementary Ising spin model is proposed for demonstrating cascading failures (break-downs, blackouts, collapses, avalanches, ...) that can occur in realistic networks for distribution and delivery by suppliers to consumers. A ferromagnetic Hamiltonian with quenched random fields results from policies that maximize the gap between demand and delivery. Such policies can arise in a competitive market where firms artificially create new demand, or in a solidary environment where too high a demand cannot reasonably be met. Network failure in the context of a policy of solidarity is possible when an initially active state becomes metastable and decays to a stable inactive state. We explore the characteristics of the demand and delivery, as well as the topological properties, which make the distribution network susceptible of failure. An effective temperature is defined, which governs the strength of the activity fluctuations which can induce a collapse. Numerical results, obtained by Monte Carlo simulations of the model on (mainly) scale-free networks, are supplemented with analytic mean-field approximations to the geometrical random field fluctuations and the thermal spin fluctuations. The role of hubs versus poorly connected nodes in initiating the breakdown of network activity is illustrated and related to model parameters

Quantum correlations and synchronization measures

The phenomenon of spontaneous synchronization is universal and only recently advances have been made in the quantum domain. Being synchronization a kind of temporal correlation among systems, it is interesting to understand its connection with other measures of quantum correlations. We review here what is known in the field, putting emphasis on measures and indicators of synchronization which have been proposed in the literature, and comparing their validity for different dynamical systems, highlighting when they give similar insights and when they seem to fail.Comment: book chapter, 18 pages, 7 figures, Fanchini F., Soares Pinto D., Adesso G. (eds) Lectures on General Quantum Correlations and their Applications. Quantum Science and Technology. Springer (2017

Message-Passing Methods for Complex Contagions

Message-passing methods provide a powerful approach for calculating the expected size of cascades either on random networks (e.g., drawn from a configuration-model ensemble or its generalizations) asymptotically as the number $N$ of nodes becomes infinite or on specific finite-size networks. We review the message-passing approach and show how to derive it for configuration-model networks using the methods of (Dhar et al., 1997) and (Gleeson, 2008). Using this approach, we explain for such networks how to determine an analytical expression for a "cascade condition", which determines whether a global cascade will occur. We extend this approach to the message-passing methods for specific finite-size networks (Shrestha and Moore, 2014; Lokhov et al., 2015), and we derive a generalized cascade condition. Throughout this chapter, we illustrate these ideas using the Watts threshold model.Comment: 14 pages, 3 figure

Stability analysis and quasinormal modes of Reissner Nordstr{\o}m Space-time via Lyapunov exponent

We explicitly derive the proper time $(\tau)$ principal Lyapunov exponent ($\lambda_{p}$) and coordinate time ($t$) principal Lyapunov exponent ($\lambda_{c}$) for Reissner Nordstr{\o}m (RN) black hole (BH) . We also compute their ratio. For RN space-time, it is shown that the ratio is $\frac{\lambda_{p}}{\lambda_{c}}=\frac{r_{0}}{\sqrt{r_{0}^2-3Mr_{0}+2Q^2}}$ for time-like circular geodesics and for Schwarzschild BH it is $\frac{\lambda_{p}}{\lambda_{c}}=\frac{\sqrt{r_{0}}}{\sqrt{r_{0}-3M}}$. We further show that their ratio $\frac{\lambda_{p}}{\lambda_{c}}$ may vary from orbit to orbit. For instance, Schwarzschild BH at innermost stable circular orbit(ISCO), the ratio is $\frac{\lambda_{p}}{\lambda_{c}}\mid_{r_{ISCO}=6M}=\sqrt{2}$ and at marginally bound circular orbit (MBCO) the ratio is calculated to be $\frac{\lambda_{p}}{\lambda_{c}}\mid_{r_{mb}=4M}=2$. Similarly, for extremal RN BH the ratio at ISCO is $\frac{\lambda_{p}}{\lambda_{c}}\mid_{r_{ISCO}=4M}=\frac{2\sqrt{2}}{\sqrt{3}}$. We also further analyse the geodesic stability via this exponent. By evaluating the Lyapunov exponent, it is shown that in the eikonal limit , the real and imaginary parts of the quasi-normal modes of RN BH is given by the frequency and instability time scale of the unstable null circular geodesics.Comment: Accepted in Pramana, 07/09/201

Popularity versus Similarity in Growing Networks

Popularity is attractive -- this is the formula underlying preferential attachment, a popular explanation for the emergence of scaling in growing networks. If new connections are made preferentially to more popular nodes, then the resulting distribution of the number of connections that nodes have follows power laws observed in many real networks. Preferential attachment has been directly validated for some real networks, including the Internet. Preferential attachment can also be a consequence of different underlying processes based on node fitness, ranking, optimization, random walks, or duplication. Here we show that popularity is just one dimension of attractiveness. Another dimension is similarity. We develop a framework where new connections, instead of preferring popular nodes, optimize certain trade-offs between popularity and similarity. The framework admits a geometric interpretation, in which popularity preference emerges from local optimization. As opposed to preferential attachment, the optimization framework accurately describes large-scale evolution of technological (Internet), social (web of trust), and biological (E.coli metabolic) networks, predicting the probability of new links in them with a remarkable precision. The developed framework can thus be used for predicting new links in evolving networks, and provides a different perspective on preferential attachment as an emergent phenomenon

Node Vulnerability under Finite Perturbations in Complex Networks

A measure to quantify vulnerability under perturbations (attacks, failures, large fluctuations) in ensembles (networks) of coupled dynamical systems is proposed. Rather than addressing the issue of how the network properties change upon removal of elements of the graph (the strategy followed by most of the existing methods for studying the vulnerability of a network based on its topology), here a dynamical definition of vulnerability is introduced, referring to the robustness of a collective dynamical state to perturbing events occurring over a fixed topology. In particular, we study how the collective (synchronized) dynamics of a network of chaotic units is disrupted under the action of a finite size perturbation on one of its nodes. Illustrative examples are provided for three systems of identical chaotic oscillators coupled according to three distinct well-known network topologies. A quantitative comparison between the obtained vulnerability rankings and the classical connectivity/centrality rankings is made that yields conclusive results. Possible applications of the proposed strategy and conclusions are also discussed